Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
نویسندگان
چکیده
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication when we compute 2P+Q from given points P , Q on the curve. We give applications to simultaneous multiple scalar multiplication and to the Elliptic Curve Method of factorization. We show how this improvement together with another idea can speed the computation of the Weil and Tate pairings by up to 7.8%.
منابع مشابه
Complete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملProject : Supersingular Curves and the Weil Pairing in Elliptic Curve Cryptography
Even first semester calculus students are aware of how calculus, hence analysis, is used to solve problems in engineering. In recent decades the engineering world is gaining more exposure to algebra through the powerful problem solutions it provides. One area that algebra has made significant contributions to is cryptography and, more specifically, public key cryptography. In this paper we aim ...
متن کاملOn a Relation between the Ate Pairing and the Weil Pairing for Supersingular Elliptic Curves
The hyperelliptic curve Ate pairing provides an efficient way to compute a bilinear pairing on the Jacobian variety of a hyperelliptic curve. We prove that, for supersingular elliptic curves with embedding degree two, square of the Ate pairing is nothing but the Weil pairing. Using the formula, we develop an X -coordinate only pairing inversion method. However, the algorithm is still infeasible...
متن کاملExtension Field for Xate Pairing with Freeman Curve
In recent years, pairing-based cryptographies such as ID-based cryptography [1] and group signature [2] have been studied. For their implementations, pairings such as Weil pairing [1], Tate pairing, Ate pairing [3] and Xate pairing [4] have been used. In order to implement these pairings, several kinds of ordinary pairing-friendly curves such as Miyaji-Nakabayashi-Takano (MNT) curve [5], Barret...
متن کاملThe Weil pairing on elliptic curves over C
To help motivate the Weil pairing, we discuss it in the context of elliptic curves over the field of complex numbers.
متن کامل